package com.arithmetic.binaryTree;


/**
 * 二叉树的CRUD
 */
public class BinaryTreeDemo2 {

    /**
     * public class BinarySearchTree {
     *   private Node tree;
     *
     *   public Node find(int data) {
     *     Node p = tree;
     *     while (p != null) {
     *       if (data < p.data) p = p.left;
     *       else if (data > p.data) p = p.right;
     *       else return p;
     *     }
     *     return null;
     *   }
     *
     *   public static class Node {
     *     private int data;
     *     private Node left;
     *     private Node right;
     *
     *     public Node(int data) {
     *       this.data = data;
     *     }
     *   }
     * }
     */
}
